Bin packing and multiprocessor scheduling problems with side constraint on job types
نویسندگان
چکیده
منابع مشابه
A Hybrid Heuristic for Bin-Packing and Multiprocessor Scheduling
The bin packing (BP) problem consists of finding the minimum number m of bins of capacity C necessary to pack a set of weighted items so that the sum of the weights of the items in each bin does not exceed the bin’s capacity. BP is known to be closely related to the multiprocessor scheduling problem (P‖Cmax), which is the problem of scheduling n independent tasks with associated processing time...
متن کاملSolving Balancing and Bin-Packing problems with Constraint Programming
This work could not have been achieved without the support of the following persons. My parents who encourage me to finish this thesis (even by coming in Providence). They are great example for their five children. My wife Caro who supports me everyday. She's always there to remind me what is the most important in my life and helps me to find a good balance between work, family and friends. Yve...
متن کاملAn Application of Bin-Packing to Multiprocessor Scheduling
Processing Time first algorithm always finds a schedule having makespan within 43 1. Key words, bin packing, multiprocessor scheduling, approximation.Single capacity bin-packing algorithms were applied to solve this problem. Available system resources, the scheduling algorithm must be able to maintain a job working set. Bounds for multiprocessor scheduling with resource.We consider a natural ge...
متن کاملOnline algorithms with advice for bin packing and scheduling problems
We consider the setting of online computation with advice and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of 1 with only a constant number of bits of advice per request. For the bin packing problem, we give an online algorithm with advice that is (1 + ε)competitive and uses...
متن کاملA Constraint for Bin Packing
We introduce a constraint for one-dimensional bin packing. This constraint uses propagation rules incorporating knapsack-based reasoning, as well as a lower bound on the number of bins needed. We show that this constraint can significantly reduce search on bin packing problems. We also demonstrate that when coupled with a standard bin packing search strategy, our constraint can be a competitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1983
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90071-9